A Density-Peak-Based Clustering Method for Multiple Densities Dataset

نویسندگان

چکیده

Clustering methods in data mining are widely used to detect hotspots many domains. They play an increasingly important role the era of big data. As advanced algorithm, density peak clustering (DPC) algorithm is able deal with arbitrary datasets, although it does not perform well when dataset includes multiple densities. The parameter selection cut-off distance dc normally determined by users’ experience and could affect result. In this study, a density-peak-based method proposed clusters from datasets densities shapes. Two improvements made regarding limitations existing methods. First, DPC finds difficult Each cluster has unique shape interior different This adopts step merging approach solve problem. Second, high points can automatically be selected without manual participation, which more efficient than methods, require user-specified parameters. According experimental results, applied various performs better traditional DPC.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Evaluation of a Density-based Clustering Method for Reducing Very Large Spatio- temporal Dataset

Spatio-temporal datasets are often very large and difficult to analyse. Today, a lot of interest has arisen towards data-mining techniques to reduce very large spatio-temporal datasets into relevant subsets as well as to help visualisation tools to effectively display the results. Cluster-based mining methods have proven to be successful at reducing the large size of raw data by retrieving its ...

متن کامل

DenPEHC: Density peak based efficient hierarchical clustering

Existing hierarchical clustering algorithms involve a flat clustering component and an additional agglomerative or divisive procedure. This paper presents a density peak based hierarchical clustering method (DenPEHC), which directly generates clusters on each possible clustering layer, and introduces a grid granulation framework to enable DenPEHC to cluster large-scale and high-dimensional (LSH...

متن کامل

ISC–Intelligent Subspace Clustering, A Density Based Clustering Approach for High Dimensional Dataset

Many real-world data sets consist of a very high dimensional feature space. Most clustering techniques use the distance or similarity between objects as a measure to build clusters. But in high dimensional spaces, distances between points become relatively uniform. In such cases, density based approaches may give better results. Subspace Clustering algorithms automatically identify lower dimens...

متن کامل

An improved method for density-based clustering

Knowledge discovery in large multimedia databases which usually contain large amounts of noise and high-dimensional feature vectors is an increasingly important research issue. Density-based clustering is proved to be much more efficient when dealing with such databases. However, its clustering quality mainly depends on the parameter setting. For the adequate choice of the parameters to be pres...

متن کامل

An Accurate Grid -based PAM Clustering Method for Large Dataset

Clustering is the procedure to group similar objects together. Several algorithms have been proposed for clustering. Among them, the K-means clustering method has less time complexity. But it is sensitive to extreme values and would cause less accurate clustering of the dataset. However, K-medoids method does not have such limitations. But this method uses user-defined value for K. Therefore, i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ISPRS international journal of geo-information

سال: 2021

ISSN: ['2220-9964']

DOI: https://doi.org/10.3390/ijgi10090589